Tight Bound on Johnson's Algorithm for Maximum Satisfiability
نویسندگان
چکیده
منابع مشابه
Tight Bound on Johnson's Algorithm for Maximum Satisfiability
We present new techniques that give a more thorough analysis on Johnson's classical algorithm for the Maximum Satisfiability problem. In contrast to the common belief for two decades that Johnson's Algorithm has performance ratio 1 2, we show that the performance ratio is 2 3 and that this bound is tight. Moreover, we show that simple generalizations of Johnson's algorithm do not improve the pe...
متن کاملOn Partitioning for Maximum Satisfiability
Partitioning formulas is motivated by the expectation to identify easy to solve subformulas, even though at the cost of having more formulas to solve. In this paper we suggest to apply partitioning to Maximum Satisfiability (MaxSAT), the optimization version of the well-known Satisfiability (SAT) problem. The use of partitions can be naturally combined with unsatisfiability-based algorithms for...
متن کاملTight bound on the maximum number of shortest unique substrings
A substring Q of a string S is called a shortest unique substring (SUS) for position p in S, if Q occurs exactly once in S, this occurrence of Q contains position p, and every substring of S which contains position p and is shorter than Q occurs at least twice in S. The SUS problem is, given a string S, to preprocess S so that for any subsequent query position p all the SUSs for position p can ...
متن کاملImproved Algorithm of Unsatisfiability-based Maximum Satisfiability
Recently, the Maximum Satisfiability (MaxSAT) discovers a rapidly increasing number of practical applications in a wide range of different areas. Unsatisfiability-based MaxSAT algorithms have been put forward aimed at improving the performance of solving MaxSAT problem. In these algorithms, several excellent Boolean Satisfiability (SAT) solvers are employed to iteratively identify unsatisfiable...
متن کاملA Particle Swarm Algorithm for Solving the Maximum Satisfiability Problem
The Maximum Satisfiability problem (Max-SAT) is one of the most known variants of satisfiability problem. The objective is to find the best assignment for a set of Boolean variables that gives the maximum of verified clauses in a Boolean formula. Unfortunately, this problem was showed NP-complete if the number of variable per clause is higher than 3. In this paper we investigate the use of part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1999
ISSN: 0022-0000
DOI: 10.1006/jcss.1998.1612